import java.lang.*;
import java.util.*;

public class BinaryTreeSimple {
	private TreeNodeSimple root;
	private String type;
	
	public BinaryTreeSimple(double input) {
		root = new TreeNodeSimple(input);
		type = "double";
	}
	
	public BinaryTreeSimple(TreeNodeSimple tns) {
		root = tns;
		type = "double";
	}
	
	public double getRootValue() {
		return root.getValue();
	}
	
	public String getType() {
		return type;
	}
	
	public void setRootValue(double input) {
		root.setValue(input);
	}
	
	public double find(double k) {
		
		return -1.0; // negative number means the value is not found. 
	}
	
	public void printRootValue() {
		System.out.println(root.getValue());
	}
	
	public static void main(String[] args) {
		BinaryTreeSimple bt = new BinaryTreeSimple(4.4);
		bt.printRootValue();
	}

}
